Covariance matrix testing in high dimension using random projections

نویسندگان

چکیده

Estimation and hypothesis tests for the covariance matrix in high dimensions is a challenging problem as traditional multivariate asymptotic theory no longer valid. When dimension larger than or increasing with sample size, standard likelihood based have poor performance. Existing dimensional are either computationally expensive very weak control of type I error. In this paper, we propose test procedure, CRAMP (covariance testing using random projections), hypotheses involving one more matrices projections. Projecting data randomly into lower subspaces alleviates curse dimensionality, allowing use tests. An extensive simulation study performed to compare against asymptotics-based procedures. application proposed method two gene expression sets presented.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on testing the covariance matrix for large dimension

We consider the problem of testing hypotheses regarding the covariance matrix of multivariate normal data, if the sample size s and dimension n satisfy lim n,s→∞ = y. Recently, several tests have been proposed in the case, where the sample size and dimension are of the same order, that is y ∈ (0,∞). In this paper we consider the cases y = 0 and y = ∞. It is demonstrated that standard techniques...

متن کامل

Random matrix theory and estimation of high-dimensional covariance matrices

This projects aims to present significant results of random matrix theory in regards to the principal component analysis, including Wigner’s semicircular law and Marčenko-Pastur law describing limiting distribution of large dimensional random matrices. The work bases on the large dimensional data assumptions, where both the number of variables and sample size tends to infinity, while their rati...

متن کامل

www.econstor.eu A note on testing the covariance matrix for large dimension

We consider the problem of testing hypotheses regarding the covariance matrix of multivariate normal data, if the sample size s and dimension n satisfy lim n,s→∞ = y. Recently, several tests have been proposed in the case, where the sample size and dimension are of the same order, that is y ∈ (0,∞). In this paper we consider the cases y = 0 and y = ∞. It is demonstrated that standard techniques...

متن کامل

Testing the structure of the covariance matrix with fewer observations than the dimension

We consider two hypothesis testing problems with N independent observations on a single m-vector, when m > N , and the N observations on the random m-vector are independently and identically distributed as multivariate normal with mean vector μ and covariance matrix Σ, both unknown. In the first problem, the m-vector is partitioned into two subvectors of dimensions m1 and m2, respectively, and ...

متن کامل

Efficient Nonnegative Matrix Factorization with Random Projections

The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical success, one of the limitations of NMF based algorithms is that it needs to store the whole data matrix in the entire process, which requires expensive storage and computation costs when the data set is large and high...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2021

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-021-01166-4